New Constructions for IPP Codes

نویسندگان

  • Tran van Trung
  • Sosina Martirosyan
چکیده

Identifiable parent property (IPP) codes are introduced to provide protection against illegal producing of copyrighted digital material. In this paper we consider explicit construction methods for IPP codes by means of recursion techniques. The first method directly constructs IPP codes, whereas the second constructs perfect hash families that are then used to derive IPP codes. In fact, the first construction provides an infinite class of IPP codes having the best known asymptotic behavior. We also prove that this class has a traitor tracing algorithm with a runtime of O(M) in general, where M is the number of codewords. AMS classification: 05

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Two-Level Fingerprinting Codes: Non-Trivial Constructions

We extend the concept of two-level fingerprinting codes, introduced by Anthapadmanabhan and Barg (2009) in context of traceability (TA) codes [1], to other types of fingerprinting codes, namely identifiable parent property (IPP) codes, secure-frameproof (SFP) codes, and frameproof (FP) codes. We define and propose the first explicit non-trivial construction for two-level IPP, SFP and FP codes.

متن کامل

On optimal codes with w-identifiable parent property

Let C be a q-ary code of length n and X ⊆ C, then d is called a descendant of X if di ∈ {xi : x ∈ X} for all 1 ≤ i ≤ n. C is said to be a w-identifiable parent property code (w-IPP code for short) if whenever d is a descendant of w (or fewer) codewords, one can always identify at least one of the parent codewords in C. In this paper, we give constructions for w-IPP codes of length w + 1. Furthe...

متن کامل

Codes with the identifiable parent property for multimedia fingerprinting

Let C be a q-ary code of length n and size M , and C(i) = {c(i) | c = (c(1), c(2), . . . , c(n)) ∈ C} be the set of ith coordinates of C. The descendant code of a sub-code C ′ ⊆ C is defined to be C ′ (1) × C ′ (2) × · · · × C ′ (n). In this paper, we introduce a multimedia analogue of codes with the identifiable parent property (IPP), called multimedia IPP codes or t-MIPPC(n,M, q), so that giv...

متن کامل

On the relationship between the traceability properties of Reed-Solomon codes

Fingerprinting codes are used to prevent dishonest users (traitors) from redistributing digital contents. In this context, codes with the traceability (TA) property and codes with the identifiable parent property (IPP) allow the unambiguous identification of traitors. The existence conditions for IPP codes are less strict than those for TA codes. In contrast, IPP codes do not have an efficient ...

متن کامل

Prolific Codes with the Identifiable Parent Property

Let C be a code of length n over an alphabet of size q. A word d is a descendant of a pair of codewords x,y ∈ C if di ∈ {xi, yi} for 1 ≤ i ≤ n. A code C is an identifiable parent property (IPP) code if the following property holds. Whenever we are given C and a descendant d of a pair of codewords in C, it is possible to determine at least one of these codewords. The paper introduces the notion ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Des. Codes Cryptography

دوره 35  شماره 

صفحات  -

تاریخ انتشار 2005